منابع مشابه
On the complexity of generalized chromatic polynomials
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcct-colorings, and rainbow colorings, and many more. N. Linial (1986) showed that the chromatic polynomial χ(G;X) is #P-hard to evaluate for all but three values X = 0, 1, 2, wh...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic Polynomials
Table of contents Introduction 1. Relation of the present work to previous researches on map-coloring and summary of results. 356 2. Definitions. 358 Chapter I. First principles in the numerical and theoretical treatment of chromatic polynomials 1. The three fundamental principles. 362 2. The quadrilateral reduction formula. 363 3. The pentagon reduction formula. 365 4. The m-gon reduction form...
متن کاملchromatic polynomials of some nanostars
let g be a simple graph and (g,) denotes the number of proper vertex colourings of gwith at most colours, which is for a fixed graph g , a polynomial in , which is called thechromatic polynomial of g . using the chromatic polynomial of some specific graphs, weobtain the chromatic polynomials of some nanostars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90034-7